On the Linear Quadratic Minimum-fuel Problem
نویسندگان
چکیده
E.I.Verriest and F.L.Lewis have presented in [1] a new method to approach the minimum-time control of linear continous-time systems avoiding the Bang-Bang control. Their method relied on the optimization of a cost including time energy and precisions terms. Then, N.Elalami and N.Znaidi [2], extended these results to the discrete-time linear systems. The objective of this work is to propose an approach for minimal-fuel problem where the term of consumption is increased by an energetic term in order to avoid Bang-off-Bang control and singular intervals . Indeed we consider the equation of Hamilton-Jacobi-Bellman(HJB) relating to the problem of minimal consumption. And by making use of a nonlinear programming problem on a partition of R, the solution of the minimum-fuel problem, according to the Riccati matrix, is reduced to the resolution of a system of differential equation.
منابع مشابه
A New Approach for Solving Interval Quadratic Programming Problem
This paper discusses an Interval Quadratic Programming (IQP) problem, where the constraints coefficients and the right-hand sides are represented by interval data. First, the focus is on a common method for solving Interval Linear Programming problem. Then the idea is extended to the IQP problem. Based on this method each IQP problem is reduced to two classical Quadratic Programming (QP) proble...
متن کاملAbout One Sweep Algorithm for Solving Linear-Quadratic Optimization Problem with Unseparated Two-Point Boundary Conditions
In the paper a linear-quadratic optimization problem (LCTOR) with unseparated two-point boundary conditions is considered. To solve this problem is proposed a new sweep algorithm which increases doubles the dimension of the original system. In contrast to the well-known methods, here it refuses to solve linear matrix and nonlinear Riccati equations, since the solution of such multi-point optimi...
متن کاملA NEW APPROACH FOR SOLVING FULLY FUZZY QUADRATIC PROGRAMMING PROBLEMS
Quadratic programming (QP) is an optimization problem wherein one minimizes (or maximizes) a quadratic function of a finite number of decision variable subject to a finite number of linear inequality and/ or equality constraints. In this paper, a quadratic programming problem (FFQP) is considered in which all cost coefficients, constraints coefficients, and right hand side are characterized by ...
متن کاملNear Minimum Fuel Maneuvers for Multi Spacecraft Interferometric Imaging in Near Earth Orbit
In this article a methodology to obtain near-minimum fuel maneuvers for space-based interferometric imaging systems located in near-earth orbits, subject to the Clohessy-Wiltshire equations, is proposed. The methodology consists of a hierarchical controller consisting of higher level Non Linear Programming problem and a lower level Linear Quadratic Regulator. The solutions are obtained with the...
متن کاملFinding the Best Coefficients in the Objective Function of a Linear Quadratic Control Problem
Finding the best weights of the state variables and the control variables in the objective function of a linear-quadratic control problem is considered. The weights of these variables are considered as two diagonal matrices with appropriate size and so the objective function of the control problem becomes a function of the diagonal elements of these matrices. The optimization problem which is d...
متن کامل